منابع مشابه
On Worst-Case Robin Hood Hashing
We consider open addressing hashing and implement it by using the Robin Hood strategy; that is, in case of collision, the element that has traveled the farthest can stay in the slot. We hash ∼ αn elements into a table of size n where each probe is independent and uniformly distributed over the table, and α < 1 is a constant. Let Mn be the maximum search time for any of the elements in the table...
متن کاملDistributional analysis of Robin Hood linear probing hashing with buckets
This paper presents the first distributional analysis of a linear probing hashing scheme with buckets of size b. The exact distribution of the cost of successful searches for a bα-full table is obtained, and moments and asymptotic results are derived. With the use of the Poisson transform distributional results are also obtained for tables of size m and n elements. A key element in the analysis...
متن کاملA New Approach to Analyzing Robin Hood Hashing
Robin Hood hashing is a variation on open addressing hashing designed to reduce the maximum search time as well as the variance in the search time for elements in the hash table. While the case of insertions only using Robin Hood hashing is well understood, the behavior with deletions has remained open. Here we show that Robin Hood hashing can be analyzed under the framework of finite-level fin...
متن کاملThe Robin Hood Syndrome:
Street gangs pose serious threats to their members, to their victims, and to communities at large. The behavior problems associated with gangs are many and varied. Suggested causes for the emergence of gangs are complicated, and many of them are interdependent. Interventions planned to rehabilitate individuals and to weaken the power of the gang are numerous. Research shows that few of these in...
متن کاملRobin Hood Hashing really has constant average search cost and variance in full tables
Thirty years ago, the Robin Hood collision resolution strategy was introduced for open addressing hash tables, and a recurrence equation was found for the distribution of its search cost. Although this recurrence could not be solved analytically, it allowed for numerical computations that, remarkably, suggested that the variance of the search cost approached a value of 1.883 when the table was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2004
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539702403372